A Space-Efficient Probabilistic Simulation Algorithm

In the context of probabilistic automata, time efficient algorithms for probabilistic simulations have been proposed lately. The space complexity thereof is quadratic in the size of the transition relation, thus space requirements often become the practical bottleneck. In this paper, we exploit ideas from [6] to arrive at a space-efficient algorithm for computing probabilistic simulations based on partition refinement. Experimental evidence is given showing that not only the space-efficiency is improved drastically. The experiments often require orders of magnitude less time.